Construction of a Number Greater than One Whose Powers Are Uniformly Distributed modulo One
نویسندگان
چکیده
We study how to construct a number greater than one whose powers are uniformly distributed modulo 1. Also we prove that for every λ > 0 there is a dense set of computable numbers α > 1 such that the discrepancy of {λα}n=1 is O(N − 1 4+ε ).
منابع مشابه
Uniformly distributed sequences of p-adic integers, II
The paper describes ergodic (with respect to the Haar measure) functions in the class of all functions that are defined on (and take values in) the ring Zp of p-adic integers, and satisfy (at least, locally) the Lipschitz condition with coefficient 1. Equiprobable (in particular, measure-preserving) functions of this class are described also. In some cases (and especially for p = 2) the descrip...
متن کاملGraph powers, Delsarte, . . .
The k-th p-power of a graph G is the graph on the vertex set V (G), where two k-tuples are adjacent iff the number of their coordinates which are adjacent in G is not congruent to 0 modulo p. The clique number of powers of G is poly-logarithmic in the number of vertices, thus graphs with small independence numbers in their p-powers do not contain large homogenous subsets. We provide algebraic u...
متن کاملGraph Powers, Delsarte, Hoffman, Ramsey, and Shannon
The k-th p-power of a graph G is the graph on the vertex set V (G), where two k-tuples are adjacent iff the number of their coordinates which are adjacent in G is not congruent to 0 modulo p. The clique number of powers of G is poly-logarithmic in the number of vertices, thus graphs with small independence numbers in their p-powers do not contain large homogenous subsets. We provide algebraic u...
متن کاملNormality in non-integer bases and polynomial time randomness
It is known that if x ∈ [0, 1] is polynomial time random (i.e. no polynomial time computable martingale succeeds on the binary fractional expansion of x) then x is normal in any integer base greater than one. We show that if x is polynomial time random and β > 1 is Pisot, then x is “normal in base β”, in the sense that the sequence (xβ)n∈N is uniformly distributed modulo one. We work with the n...
متن کاملNetwork Location Problem with Stochastic and Uniformly Distributed Demands
This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996